Method and apparatus for transmissions via multiple beams in a wireless communication system

ABSTRACT

A method for a wireless communications system is disclosed. In one example, user equipment (UE) (e.g. a mobile phone) receives an indication from a network (for example, by way of a transmission and reception point (TRP)) indicating whether a first transmission and a second transmission to the UE can be combined for decoding. The UE also receives the first transmission via a first UE beam and the second transmission via a second UE beam. The first transmission and the second transmission are received concurrently. The first and second transmissions can arrive via different serving beams and/or different TRPs of the same cell. Based on the indication, the UE combines the first and second transmissions for decoding purposes.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to and is a divisional of U.S. application Ser. No. 15/634,476, filed on Jun. 27, 2017, entitled “METHOD AND APPARATUS FOR TRANSMISSIONS VIA MULTIPLE BEAMS IN A WIRELESS COMMUNICATION SYSTEM”, which claims priority to U.S. Provisional Patent Application Ser. No. 62/358,262, filed on Jul. 5, 2016, and entitled METHOD AND APPARATUS FOR TRANSMISSIONS VIA MULTIPLE BEAMS IN A WIRELESS COMMUNICATION SYSTEM. The entirety of U.S. application Ser. No. 15/634,476 and the entirety of U.S. Provisional Patent Application Ser. No. 62/358,262 is hereby incorporated by reference.

TECHNICAL FIELD

The subject disclosure is directed to wireless communications, and is more particularly related to a cell (e.g. a 5G cell) in which a user equipment (UE) (e.g. a mobile phone) and one or more transmission and reception points (TRPs) residing within the cell communicate with each other with multiple serving and UE beams.

BACKGROUND

The 3rd Generation Partnership Project (3GPP) is a group that is trying to investigate and develop technology components for the next generation access technology, namely 5G. 3GPP commenced its standardization activities vis-a-vis the 5G in March of 2015. 3GPP regularly publishes its meeting notes that describe its proposals, reference architecture models and study items for 5G. For example, 3GPP envisions a single cell architecture that contains multiple TRPs (also referred to as distributed units (DUs)) and supports intra-cell mobility of the UE as it travels among the TRPs. This architecture presents numerous challenges to which the inventions disclosed herein provide solutions.

SUMMARY

The following presents a simplified summary of the specification to provide a basic understanding of some aspects of the specification. This summary is not an extensive overview of the specification. It is intended to neither identify key or critical elements of the specification nor delineate any scope particular to any embodiments of the specification, or any scope of the claims. Its sole purpose is to present some concepts of the specification in a simplified form as a prelude to the more detailed description that is presented later.

As used herein, the following terms can be referred to by the respective abbreviations: 3rd Generation Partnership Project (3GPP); 5th generation (5G); Block Error Rate (BER); Beam Specific Reference Signal (BRS); Base Station (BS); Cloud RAN (C-RAN); Connected State (CONN); Channel Quality Indicator (CQI); Channel State Information (CSI); Closed Subscriber Group (CSG); Central Unit (CU); Downlink (DL); Distributed Unit (DU); Evolved Node B (eNB or eNodeB); Evolved Universal Terrestrial Radio Access (E-UTRA); Frequency-Division Duplex (FDD); Global System for Mobile Communications (GSM); Hybrid Automatic Repeat Request (HARQ); Long Term Evolution (LTE); Medium Access Control (MAC); Multiple Input, Multiple Output (MIMO); Network Function Virtualization (NFV); New RAT (NR); Network (NW); Protocol Data Unit (PDU); Physical (PHY); Public Land Mobile Network (PLMN); Radio Access Technology (RAT); Radio Frequency (RF); Radio Resource Control (RRC); Reference Signal Receiving Power (RSRP); Reference Signal Receiving Quality (RSRQ); Reception (Rx); Signal to Interference Plus Noise Ratio (SINR); Semi-Persistent Scheduling (SPS); Tracking Area (TA); Tracking Area Code (TAC); Tracking Area Identity (TAI); Transmission Reception Point (TRP); TRP Group (TRPG); Technical Specification (TS); Transmission Time Interval (TTI); Transmission (Tx); User Equipment (UE); and Universal Terrestrial Radio Access (UTRA).

In various non-limiting embodiments, by way of example, the disclosed subject matter provides a method for a user equipment (UE), in which the UE receives an indication about whether a first transmission and a second transmission that the UE will receive (or has already received) can be combined for decoding. The UE receives the first transmission via a first UE beam and receives the second transmission via a second UE beam respectively, and the two transmissions occur concurrently.

In a further non-limiting example, the UE determines whether to combine the first and second transmissions for decoding, based on the indication.

In a further non-limiting example, the disclosed subject matter provides a method for a user equipment (UE), in which the UE receives an indication about whether the UE should transmit information for the same data unit or information for different data units, via a first transmission and a second transmission respectively. The UE makes the first transmission via a first UE beam and the second transmission via a second UE beam. The two transmissions occur concurrently.

In a further non-limiting example, the UE determines whether to transmit information related to the same data unit or information related to different data units, via the first and second transmissions respectively, based on the indication.

In a further non-limiting example, the first and second transmissions can occur via different serving beams for the UE.

In a further non-limiting example, the first and second transmissions can be received via different serving beams for the UE.

In a further non-limiting example, the first and second transmissions can be performed by using the same radio resources.

In a further non-limiting example, the indication is transferred together with scheduling information.

In a further non-limiting example, the UE determines that the two transmissions contain the same content, because the signaling carrying their respective scheduling information is the same.

In a further non-limiting example, the UE can receive or transmit the first transmission via a first transmission and reception point (TRP) and receive or transmit the second transmission via the second TRP, wherein the two TRPs reside in the same cell.

In addition, further example implementations are directed to systems, devices and/or other articles of manufacture that facilitate communication between a UE and one or more TRPs residing within the same cell, via multiple serving beams and UE beams, as further detailed herein. Network can properly decide to schedule concurrent transmissions via different network beams with same or different content.

These and other features of the disclosed subject matter are described in more detail below.

BRIEF DESCRIPTION OF THE DRAWINGS

The devices, components, systems, and methods of the disclosed subject matter are further described with reference to the accompanying drawings in which:

FIG. 1 illustrates the beam concept in 5G, where each TRP is generating multiple narrow beams, for example, as part of beam sweeping;

FIG. 2 illustrates exemplary radio network architectures that the 3GPP desires to support with NR including, for example, stand-alone, co-sited with LTE and centralized baseband architectures.

FIG. 3 illustrates more exemplary radio network architectures that the 3GPP desires to support with NR including, for example, centralized with low performance transport and shared RAN;

FIG. 4 illustrates various example deployment scenarios for arrangement of cells having single TRP;

FIG. 5 illustrates various example deployment scenarios for arrangement of cells having multiple TRP;

FIG. 6 illustrates an example 5G cell;

FIG. 7 illustrates side-by-side comparison between an example 4G cell and an example 5G cell;

FIG. 8 illustrates an example high frequency HF-NR system that facilitates gain compensation by beamforming;

FIG. 9 illustrates an example HF-NR system that facilitates weakened interference by beamforming;

FIG. 10 illustrates an example methodology for UL transmission from a UE to a network;

FIG. 11 illustrates an example methodology for DL transmission from a network to a UE;

FIG. 12 illustrates an example methodology for performing multiple concurrent DL transmissions from a network to a UE;

FIG. 13 illustrates an example methodology for performing multiple concurrent UL transmissions from a UE to a network;

FIG. 14 illustrates example beam mapping between a network and a UE;

FIG. 15 illustrates and example multiple access wireless communication system in which various embodiments directed to concurrent UL transmissions and concurrent DL transmissions can be implemented;

FIG. 16 illustrates a simplified block diagram of an example MIMO system depicting an example embodiment of a transmitter system (also referred to herein as an access network) and a receiver system (also referred to herein as an access terminal (AT) or user equipment (UE)), suitable for incorporation of various aspects directed to various networks. TRPs and UEs described herein;

FIG. 17 depicts an example non-limiting device or system suitable for performing various aspects of the disclosed subject matter;

FIG. 18 depicts a simplified functional block diagram of an example non-limiting communication device suitable for incorporation of various aspects of the subject disclosure;

FIG. 19 depicts a simplified block diagram of example program code shown in FIGS. 10-13, suitable for incorporation of various aspects of the subject disclosure; and

FIG. 20 illustrates a schematic diagram of an example mobile device (e.g. a mobile handset, user device, user equipment, or access terminal) that can facilitate various non-limiting aspects of the disclosed subject matter in accordance with the embodiments described herein.

DETAILED DESCRIPTION

The 5G technology aims to support the following three families of usage scenarios, and specifically to satisfy both urgent market needs and more long-term requirements set forth by the ITU-R IMT-2020: (i) eMBB (enhanced Mobile Broadband), (ii) mMTC (massive Machine Type Communications) and (iii) URLLC (Ultra-Reliable and Low Latency Communications). An objective of 3GPP's 5G study item on new radio access technology is to identify and develop technology components for new radio systems that can operate in any spectrum band ranging from low frequencies to at least 100 GHz. However, radio systems that try to support high carrier frequencies (e.g. up to 100 GHz) will encounter a number of challenges in the area of radio propagation. For example, with increasing carrier frequency, the path loss would also increase.

According to R2-162366 (3GPP TSG-RAN WG2 Meeting #93bis), in lower frequency bands (e.g. in current Long Term Evolution (LTE) bands <6 GHz), the required cell coverage is provided by forming a wide sector beam for transmitting downlink common channels. However, utilizing wide sector beam on higher frequencies (>>6 GHz) is problematic in that the cell coverage is reduced for the same antenna gain. Thus, in order to provide the required cell coverage on higher frequency bands, higher antenna gain is needed to compensate for the increased path loss. To increase the antenna gain over a wide sector beam, larger antenna arrays, where the number of antenna elements range from tens to hundreds, are used to form high gain beams. As a consequence, the high gain beams are formed narrower than a typical wide sector beam, and so multiple high gain beams are needed for transmitting downlink common channels to cover the required cell area. The number of concurrent high gain beams that an access point is able to form is limited by the cost and complexity of the utilized transceiver architecture. In practice, for higher frequencies, the number of concurrent high gain beams is much less than the total number of beams required to cover the cell area. In other words, the access point is able to cover only a portion of the cell area by using a subset of beams at any given time.

According to R2-163716 (3GPP TSG-RAN WG2 Meeting #94), beamforming is a signal processing technique used in antenna arrays for directional signal transmission/reception. In beamforming, a beam is be formed by combining elements in a phased array of antennas in such a way that signals at particular angles experience constructive interference while others experience destructive interference. Different beams are formed simultaneously using multiple arrays of antennas. According to R2-162709 (3GPP TSG RAN WG2 Meeting #93bis) and as shown in FIG. 1, the 5G cell 100 includes an evolved Node B (eNB) 110 communicably coupled to multiple transmission/reception points (TRPs) 120, 124 and 128, which can be either centralized or distributed. Each TRP 120, 124 or 128 can and is shown to form multiple beams. The number of beams formed by the TRP 120, 124 or 128 and the number of simultaneous beams in the time/frequency domain depend on the number of antenna array elements and the radio frequency RF being utilized by the TRP 120, 124 or 128.

Potential mobility types for the new radio access technology (NR) include intra-TRP mobility, inter-TRP mobility and inter-NR eNB mobility. According to R2-162762 (TSG RAN WG2 Meeting #93bis), the reliability of a system purely relying on beamforming and operating at higher frequencies is subject to challenges. A reason being that the coverage of such a system is more sensitive to both time and space variations. As a consequence, the signal to interference plus noise ratio (SINR) of its link (which is narrower than LTE) can drop much quicker than in the case of LTE.

In the 5G systems, fairly regular grid-of-beams coverage patterns with tens or hundreds of candidates for serving beams per node can be created, by using antenna arrays having hundreds of elements at access nodes. However, the coverage area of an individual serving beam from such an array would be small, down to the order of some tens of meters in width. As a consequence, channel quality degradation outside a currently-in-use serving beam's area would happen quicker than in the case of wide area coverage (e.g. as provided by LTE).

According to R3-160947 (3GPP TR 38.801 V0.1.0 (2016-04)), the scenarios illustrated in FIGS. 2 and 3 show exemplary radio network architectures that the 3GPP desires to support with the NR. FIG. 2 illustrates three example network architectures 210, 230 and 250. In the network architecture 210, the core network 212 is shown communicably coupled to two NR base stations 214 and 216.

In the network architecture 230, the core network 232 is communicably coupled to Sites A 234 and Site B 236, wherein those sites support both NR and LTE functionality. In network architecture 250, the core network 252 is communicably coupled to a central baseband unit 254, which serves as the central unit of the architecture 252 and performs centralized radio access network (RAN) processing. The central baseband unit 254, in turn, is communicably coupled to the lower layers of the NR base stations 256, 258 and 260 by way of high performance transport links.

FIG. 3 illustrates two more example radio network architectures 310 and 340 that the 3GPP desires to support with NR. In architecture 310, the core network 312 is communicably coupled to the central unit 314 that includes the upper layers of the NR base station. The central unit 314, in turn, is communicably coupled to the lower layers of the NR base stations 316, 318 and 320 via low performance transport links. In architecture 340, each core network operator 342, 344 and 346 is communicably coupled to both the NR base stations 348 and 350.

According to R2-164306 (3GPP TSG-RAN WG2 #94), the 3GPP desires to study the deployments of cell layouts for standalone NR in macro cells, heterogeneous cells and small cells. According to 3GPP TSG-RAN WG2 #94 meeting minutes for the May 23-26, 2016 meeting, one NR eNB corresponds to one or many TRPs. Typically, network controlled mobility involves two levels. In one level, the mobility control is driven by the RRC at the cell level. In the other level, there is zero or minimum involvement by the RRC (e.g. at MAC/PHY layers). According to R2-162210 (3GPP TSG-RAN WG2 Meeting #93bis), 3GPP desires to keep the principle of 2-level mobility handling in NR. One level would include cell level mobility and the other level would include beam level mobility management. Regarding cell level mobility, the cell selection or reselection occurs when the UE (or mobile device) is in IDLE state and the handover occurs when the UE or mobile device is in connected (CONN) state. The mobility control is driven by the RRC in the CONN state. Regarding beam level management, layer 1 (L1 or physical layer) handles appropriate selection of the TRP to be used by a UE (or a mobile device) and also handles the optimal beam direction.

5G systems are expected to rely heavily on “beam based mobility” to handle UE mobility, in addition to relying on the conventional handover based UE mobility. Technologies like MIMO, fronthauling, C-RAN and NFV will allow the coverage area controlled by a single 5G node to grow, thus increasing the possible applications for beam level management and reducing the need for cell level mobility. All mobility within the coverage area of one 5G node could be handled based on beam level management. In that scenario, handovers would only occur in case of UE mobility from the coverage area of one 5G node to the coverage area of another 5G node.

FIGS. 4, 5, 6 and 7 show some examples of cell design in 5G NR. FIG. 4 shows an example deployment with a single-TRP cell. The deployment 400 includes numerous cells having a single TRP, for example cell 410 includes TRP 412 and cell 420 includes TRP 422. Some cells are clustered together and others are isolated. FIG. 5 shows an example deployment with multiple-TRP cells. The deployment 500 includes a cell 510 having multiple TRPs 512, 514 and 516. The deployment 500 also includes a cell 520 having TRPs 522 and 524. FIG. 6 shows an example deployment 600 having one 5G cell 610 comprising a 5G node 630 and multiple TRPs 612, 614 and 616. FIG. 7 shows a comparison between a LTE cell 710 and a 5G NR cell 750. The LTE cell 710 includes an eNB 712 communicably coupled to multiple cells 714 and 716. Cell 714 is shown to include TRP 720 and cell 716 is shown to include TRP 722. The NR cell 750 includes a centralized unit 752 communicably coupled to a single-cell 756. The single-cell 756 includes multiple distributed units (DU) 762 and 764. It will be understood that apart from performing a handover based on Radio Research Management (RRM) measurement, 3GPP desires that a 5G UE should be able to adapt the serving beam to maintain 5G connectivity even in case of beam quality fluctuation and/or UE intra-cell mobility. However, in order to do that, 5G Node-B and UE must be able to track and change the serving beam properly (referred to as beam tracking hereafter).

Some terminology and assumptions are specified in the following and may be used hereafter. The term base station (BS), as used in the subject disclosure, refers to a network central unit in the NR that is used to control one or multiple TRPs associated with one or multiple cells. Communication between BS and TRP(s) can occur via a fronthaul connection. A BS could also be referred to as central unit (CU), eNB, or Node B. A TRP, as used herein, is a transmission and reception point that provides network coverage and directly communicates with UEs. A TRP could also be referred to as a distributed unit (DU). A cell, as used herein, is composed of one or multiple associated TRPs, i.e. the coverage of the cell is a superset of the coverage of all the individual TRP(s) associated with the cell. One cell is controlled by one BS. A cell can also be referred to as a TRP group (TRPG). A serving beam, as used herein, for a UE is a beam generated by a network, for example, by a TRP of the network, which is used to communicate with the UE, for example, for transmission and/or reception.

Beam sweeping is used to cover all possible directions for transmission and/or reception. For beam sweeping, numerous beams are required. As it is not possible to generate all these beams concurrently, beam sweeping means generation of a subset of these beams in one time interval and generation of different subsets of beam(s) in other time interval(s). Stated differently, beam sweeping means changing beams in time domain, such that all possible directions are covered after several time intervals. Beam sweeping number refers to the necessary number of time interval(s) needed to sweep beams in all possible directions once for transmission and/or reception. The control/instruction signaling related to beam sweeping would include a “beam sweeping number”. The beam sweeping number indicates the number of times during a predetermined time period that various different subsets of beams must be generated to cover the desired area.

On the network side, a NR using beamforming could be standalone, meaning that the UE can directly camp on or connect to NR. Also, a NR using beamforming and a NR not using beamforming can coexist, for example, in different cells. A TRP can apply beamforming to both data and control signaling transmissions and receptions, if possible and beneficial. The number of beams generated concurrently by a TRP depends on the TRP's capability. For example, the maximum number of beams generated concurrently by different TRPs in the same cell may be the same and those in different cells may be different. Beam sweeping is necessary. e.g. for the control signaling to be provided in every direction. In various embodiments, downlink timing of TRPs in the same cell are synchronized and the RRC layer of the network side is located in the BS. The TRP should support both UEs with UE beamforming and UEs without UE beamforming, meaning that the TRP should support UEs of different capabilities and support UE designs based on different UE releases.

On the UE side, a UE may perform beamforming for reception and/or transmission, if possible and beneficial. The number of beams generated concurrently by a UE would depend on the UE's capability, for example, depending on whether generating more than one beam is possible for the UE. Beam(s) generated by a UE are typically wider than beam(s) generated by an eNB. Beam sweeping for transmission and/or reception is generally not necessary for user data but could be necessary for other signaling, for example, to perform a measurement. It is to be appreciated that not every UE supports UE beamforming, for example, due to UE capability or because UE beamforming was not supported by NR's first few release(s). One UE can to be served by multiple beams from one or multiple TRPs of the same cell. Same or different DL (or UL) data could be transmitted on the same radio resource via different serving beams for diversity or throughput gain. There are at least two UE (RRC) states: connected state (or called active state) and non-connected state (or called inactive state or idle state).

According to R2-162251 (3GPP TSG-RAN WG2 Meeting #92bis), beamforming can be performed on both eNB and UE sides. FIG. 8 illustrates the concept of gain compensation by beamforming in a high frequency (HF) NR system. In the example cell 800, beamforming is performed by both the eNB 810 and the UE 820. In one practical example, 3GGP expects the beamforming antenna gain at the eNB 810 to be about 15 to 30 dBi and the expected beamforming antenna gain at the UE 820 to be about 3 to 20 dBi.

From SINR perspective, FIG. 9 illustrates a cell 900 in which interference is weakened because of beamforming. Sharp beamforming reduces interference power at the serving eNB 910 from neighboring interferers eNB A 930 and eNB B 940, for example, during a downlink operation. Interference power from UEs connected to neighboring eNBs 930, 940 is also reduced because of beamforming. It is to be understood and appreciated that in a TX beamforming case, effective interference will be caused only by other TXs whose current beam(s) are also pointed in the direction of the RX. Effective interference means that the interference power is higher than the effective noise power. In a RX beamforming case, effective interference will be caused only by other TXs whose beam(s) are pointed in the same direction as the UE's 950 current RX beam direction.

According to an aspect of the subject disclosure, when the UE is in a connected state, for example, a connected state in which there has not been any data communication between the network and the UE for a certain period of time, the UE can initiate an UL transmission. For example, the UE can initiate an UL transmission upon arrival of new data at the UE that the UE wants to send to the network. For example, the user of the UE may input a text or voice message into the UE, and the UE wants to send that message to the network.

FIG. 10 illustrates an example methodology for a UL data transmission from the UE to the network. At Step 1002 of the flow diagram 1000, the UE determines that it has UL data available for transmission to the network but has no UL resources that can be used to perform the transmission. To obtain those resources, at Step 1004, the UE sends (or transmits) a scheduling request to the network and requests UL resources. In various embodiments, the UL timing of the UE may or may not be synchronized with the network/cell when the UE transmits the request. The UE may transmit the scheduling request by beamforming. In various embodiments, the UE may or may not use beam sweeping to transmit the request.

At Step 1006, the network performs UL resource scheduling. The UE's scheduling request is received by one or more TRPs of the network. In one embodiment, a TRP that receives the request schedules proper UL resources for the UE to perform UL transmission. In another embodiment, the TRP schedules the proper UL resources in coordination with the network's base station (BS). In yet another embodiment, the TRP sends the UE's request to the BS and the BS schedules the proper UL resources and communicates that information to the TRP. The TRP, in turn, provides the scheduling information about UL resources to the UE. The UL timing of the UE can be adjusted together with the UL resource scheduling. The TRP provides the UL resource scheduling information by beamforming.

At Step 1008, the UE performs UL data transmission. After the UE receives UL resource scheduling, the UE uses the UL resources to transmit pending UL data. The UE may use UE beamforming for UL transmission. The TRP uses beamforming to receive the UL transmission from the UE. Other information, for example, CSI, buffer status report (BSR), power headroom report (PHR), may be transmitted with the UL data to the TRP or BS. At Step 1010, the network, meaning the BS or the TRP, provides hybrid automatic repeat request (HARQ) feedback to the UE to indicate whether the UL transmission was successfully received. The UE may have to perform retransmission if network fails to receive the UL transmission.

According to an aspect of the subject disclosure, when the UE is in a connected state, for example, a connected state in which no data communication has occurred between the network and the UE for a certain period of time, the BS (meaning the network side) can initiate a DL transmission to the UE upon new data arrival at the network. For example, the network may receive a text or voice message intended for the user of the UE that it wants to send to the UE.

FIG. 11 illustrates an example methodology for a DL data transmission from the network to the UE. At Step 1102 of the flow diagram 1100, the network prepares for the DL transmission to the UE. Specifically, when network has DL data to be transmitted to the UE, the network determines the proper TRP(s) and the beam(s) to reach the UE. In various embodiments, beam tracking (or beam finding) may be used. Also, the UL timing of the UE must be synchronized with the network/cell before performing the DL transmission. The DL data arrival may be achieved via random access (RA) procedure. At Step 1104, the network, by way of the BS or the TRP, selects the proper DL resources for transmission of DL data and informs the UE, via a DL assignment, to expect and receive the DL data. At Step 1106, the transmission of DL assignment and DL data occurs. The DL assignment and DL data are provided by beamforming in beam(s) that can reach the UE. UE beamforming may be used for DL reception. DL assignment may be determined by TRP or BS. At Step 1108, the UE provides HARQ feedback to the network to indicate whether the DL transmission was successfully received. The network may need to perform retransmission if the UE fails to receive the DL transmission.

According to an aspect of the subject disclosure, a UE is simultaneously (or concurrently or in parallel) served/serviced by multiple serving beams from one or multiple TRPs of the same cell. According to another aspect of the subject disclosure, the network and the UE make determinations, depending on the scenario, about carrying same or different content by DL or UL transmissions on the same radio resources via different network beams. These scenarios and determination methodologies are discussed below. Factors (or means) for determining whether to carry same or different content by the transmissions via different network beams are also provided below. One factor includes assistance information from the UE, which are taken into account. According to another aspect of the invention, the UE may be able to determine whether transmissions contain same or different content. The methodology that the UE can use to make that determination is discussed below.

If a UE uses only one UE beam to receive or send multiple transmissions on the same radio resources via different network beams, the same content should be carried by the multiple transmissions to avoid interference. If the UE uses different UE beams to receive or send the multiple transmissions, same or different content could be carried by the multiple transmissions. Examples of these schemes are now illustrated with reference to FIG. 14. In an example, network beams 3, 4, and 5 can be used to serve the UE 1420, and the UE 1420 can use UE beams ‘a’ and ‘b’ to receive or send the transmissions from/to the network beams 3, 4 and 5. When network beams 3 and 4 are simultaneously used for DL or UL transmissions on the same radio resources, because the UE uses a single UE beam (i.e. beam ‘b’) to receive or send the transmissions, content carried by the transmissions must be the same (and cannot be different). When network beams 2 and 4 are simultaneously used for DL or UL transmissions on the same radio resources, because the UE 1420 can use different UE beams to receive or send the transmissions (i.e. beam ‘a’ and ‘b’), content carried by the transmissions could be the same or different.

According to an aspect of the subject disclosure, determining which and how many UE beam(s) to use for reception or transmission is an important factor in deciding whether to carry same or different content in the transmissions via different network beams. As downlink assignments and uplink scheduling are determined by the network, it is useful for the network, for example, BS or TRP(s) of the network, to be aware of information about the UE beams, explicitly or implicitly. Several alternative approaches, techniques and methodologies are discussed below, by which the network can gather information about UE beams.

In one example implementation, the network can derive the information about UE beams by measuring UE beam specific signaling from the UE. For example, the network can take measurements of the UL reference signaling. In this implementation, the network must have the capability to differentiate between different UE beams, and particularly differentiate between the measurements taken by the network for different UE beams. For example, the differentiation can be based on identities of UE beams. For another example, the differentiation can be based on per UE beam specific configuration. For example, different UE beams can be configured with different time frequency resources used to transmit the UE beam specific signaling. Then, the network can differentiate between (measurements of) different UE beams based on when and/or where the UE beam specific signaling is received. The time frequency resource for each UE beam to transmit the signaling is configured by network, and thus the network can use the configuration information to associate the time frequency information with a particular UE beam.

In another example implementation, the UE provides assistance information to the network, which assists the network with identifying and differentiating between the various UE beams. The assistance information can be related to mapping between network beam(s) and UE beam(s). For example, with reference to FIG. 14, {a: 2} and/or {b: 3, 4}, meaning that UE beam ‘a’ is paired with network/serving beam 2 and UE beam ‘b’ is paired with two network beams 3 and 4. The mapping between a network beam and a UE beam represents that transmission from the network beam can be received by the UE by using the UE beam, and likewise or alternatively, the transmission from the UE beam can be received by the network using the network beam. For example, referring again to FIG. 14, {a: 2} means that transmission/reception via network beam 2 can be received/transmitted via UE beam ‘a’.

Alternatively or additionally, the assistance information provided by the UE can identify the network beams that cannot have DL or UL transmissions with different content, for example, beams 3 and 4 in FIG. 14. Alternatively or additionally, the assistance information can be related to measured result(s) for each UE beam-to-network beam pair, for example, with reference to FIG. 14 {a: 2=xx} and/or {b: 3=yy, 4=zz} (xx, yy, and zz are measured results).

The assistance information can be provided by physical signaling. MAC control signaling, or RRC signaling. The assistance information associated with different UE beams can be provided by the UE to the network separately or together. Likewise, the assistance information associated with different TRPs can be provided by the UE to the network separately or together. Assistance information can also include association between network beam(s) and TRP(s).

In an example, information about the qualified network beam(s) is included in the assistance information. A beam can be considered (or determined) to be qualified if its measured result is larger than a predetermined threshold value. In this example, information about a beam that is not qualified may not be included in the assistance information. Whether a beam is qualified for a particular UE can be based on comparing the measured result of the beam and an associated threshold. For example, the beam is considered qualified if the measured result of the beam is better than the associated threshold. The threshold can be predefined, configured by network, and/or provided in system information.

The assistance information can be provided by the UE periodically, on request by network, and/or in response to the change of assistance information. The UE may be able to differentiate different beams generated by network, for example, based on beam identity and/or TRP identity. To provide the assistance information, a scheduling request from the UE to the network may be required in order to acquire radio resources to transmit the assistance information.

The network beam(s) can be (used as) serving beam(s) for the UE. The network beam(s) can be indicated to the UE via sending configuration information to the UE. The UE can recognize the network beam(s) by measurement, by monitoring a signal of the network, and/or by receiving configuration information from the network. Per UE beam specific configuration information can be used to differentiate or indicate a UE beam.

The network can decide whether to carry same or different content in its DL transmissions, based on its selected serving beam(s) and at least some of above information about the UE beams. The network can decide to indicate to the UE whether to carry same or different content in the UL transmissions based on its selected serving beam(s) and at least some or above information about the UE beams. The network can also take channel condition(s) and/or amount of buffered data for transmission into account in making those decisions.

Furthermore, because a serving beam change or a UE beam change can occur dynamically, for DL transmissions, the network must be able to dynamically decide whether to carry same or different content in the DL transmissions and indicate information to the UE about whether the content is the same or different. For UL transmissions, the network must be able to dynamically decide and indicate information to the UE about whether to carry same or different content in the UL transmissions. The network can indicate the above information to the UE separately or together with scheduling information. In one example, the information can be implicitly indicated by format of the scheduling information. For example, a first format is used to indicate concurrent transmissions with the same content, and a second format is used to indicate concurrent transmissions with different content.

In another example, the information can explicitly indicate whether the transmission is associated with other transmission(s), for example, based on the serving beam or UE beam's identity. For example, referring to FIG. 14, scheduling information on beam 4 could indicate “beam 2” which means that content of transmission on beam 2 is the same as that on beam 4. For another example, the scheduling information on beam 4 could indicate “UE beam a” which means that content of transmission to be received by UE beam a is the same as that on UE beam b. In yet another example, the information can explicitly indicate whether the associated transmission could be combined with other transmission(s) scheduled by scheduling information, where the indication is the same value or information, for example, a 1-bit indication. For example, if serving beams 2, 3, and 4 are used for transmissions with the same content, the indication for transmissions associated with serving beam 2, 3, and 4 are set to the same value. If serving beams 2 and 4 are used for transmissions with different content, the indication for transmissions associated with serving beams 2 and 4 are set to different values.

Concurrent transmissions can mean transmissions on the same radio resource(s) via different serving beams for the UE, or transmissions on the same radio resource(s) in the same time interval via different serving beams for the UE. Alternatively, concurrent transmissions can mean transmissions on the same radio resource(s) via different network beams controlled by the same network node, or transmissions on the same radio resource(s) in the same time interval via different network beams controlled by the same network node. Different serving beams can be utilized by different TRPs. The time interval can be TTI, subframe, or symbol. The radio resource can be the time/frequency resource. The serving beam can be a network beam that serves a UE, a network beam that can serve a UE, or a network beam that is used to communicate with a UE, for example, for transmission and/or reception. The network beam can be a beam generated by a network node, for example, a TRP. The transmissions could be DL transmissions or UL transmissions. Transmissions with the same content can mean transmissions that are okay to be combined for decoding. Decoding refers to converting from one form to another. For example, data is often encoded before transmission, for example, to reduce the requited bandwidth and provide for an efficient transmission. Typically, all data from the same data unit is encoded in the same specialized format, and therefore all data from the same data unit is also decoded by using the same scheme or sequence. Thus, data subunits of a data unit are referred herein to as having the same content. An example of such a data unit is the MAC PDU, meaning that the UE can combine multiple data transmissions associated with the same MAC PDU for decoding purposes, and treat those transmissions have having the same content.

FIG. 12 illustrates an example methodology for the subject disclosure, in which the UE receives two concurrent DL transmissions from the network. At Step 1202 of the flow diagram 1200, the UE receives an indication from the network. The indication indicates whether a first transmission and a second transmission, which the UE will receive or has already received, can be combined by the UE for decoding purposes. At Step 1204, the UE receives the first DL transmission via a first UE beam. At Step 1206, the UE receives the second DL transmission via a second UE beam. In other words, the UE uses different UE beams to receive the first transmission and the second transmission. In one embodiment, the first transmission and the second transmission are received concurrently by the UE. In one embodiment, the first transmission and the second transmission are transmitted concurrently by the network. At Step 1208, the UE determines whether to combine the first transmission and the second transmission for decoding, based on the indication.

FIG. 13 illustrates an example methodology for the subject disclosure, in which the UE transmits two concurrent UL transmissions to the network. At Step 1302 of the flow diagram 1300, the UE receives an indication from the network about whether to transmit information related to the same data unit or different data units, via a first transmission and a second transmission respectively. At Step 1304, the UE sends the first transmission via a first UE beam. At Step 1306, the UE sends the second transmission via a second UE beam. In other words, the UE uses different UE beams to transmit the first transmission and the second transmission. The content of the first and second transmissions is according to the indication. The UE decides to transmit same or different data unit via the first transmission and the second transmission based on the indication. In one embodiment, the UE sends the first transmission and the second transmission concurrently. The two transmissions can include content from the same data unit or different data units, based on the indication. At Step 1308, the network determines whether the concurrent transmissions contain same or different content based on the serving beams and/or UE beams used for the transmissions or based on the indication.

The methodologies discussed above with reference to FIGS. 12 and 13 enable a network to properly schedule concurrent transmissions with same or different content, via different network beams. In one embodiment, a network node can provide an indication to an UE about whether a first transmission and a second transmission to the UE can be combined for decoding, wherein the first transmission via a first UE beam and the second transmission via a second UE beam occur concurrently. In one embodiment, a network node can provide an indication to an UE about whether a first transmission via a first UE beam and a second transmission via a second UE beam to be transmitted by the UE should include same or different content, wherein the first transmission and the second transmission are to occur concurrently. In one example implementation, the network node provides the indication based on assistance information related to network beam or serving beams for a UE, wherein the assistance information is provided by the UE.

In one example implementation, the UE provides assistance information related to a network beam associated with the UE to a network node (e.g. a TRP). In another example, the UE provides assistance information related to a UE beam associated with the UE to a network node (e.g. a TRP). In one example, the assistance information provided by the UE to the network comprises at least information related to mapping between network beams, e.g. serving beam(s), and UE beam(s). The mapping identifies or represents the UE beam(s) that will receive DL transmission from the network beam(s), e.g. serving beam(s). The mapping can identify the network beam(s), e.g. serving beam(s), that will receive UL transmission from the UE beam(s). The assistance information can include at least information related to which network beam(s), e.g. serving beam(s), cannot be used to send transmissions with different content. The assistance information can include at least information related to measured result(s) for each UE beam (e.g. UE beam-to-network beam pair). In one example implementation, the assistance information can be provided by physical layer signaling. In one example implementation, the assistance information is provided by MAC control signaling. In one example implementation, the assistance information is provided by RRC signaling. In one embodiment, the assistance information associated with different UE beams is provided separately. Alternatively, the assistance information associated with different UE beams is provided together. In one embodiment, the assistance information associated with different TRPs is provided separately. Alternatively, the assistance information associated with different TRPs is provided together.

In one embodiment, the assistance information identifies network beam(s) or serving beam(s) as qualified, e.g. if their respective measured results are larger than their respective threshold(s). In one embodiment, the assistance information does not identify network beam(s) or serving beam(s) as qualified, or identifies them as not qualifies, e.g. if their respective measured results are not larger than their respective threshold(s). In one embodiment, whether a beam is qualified is based on at least measured result of the beam and an associated threshold. In one embodiment, the threshold is predefined. In one embodiment, the threshold is configured by the network. In one embodiment, the threshold is provided in system information.

In one embodiment, the assistance information is provided periodically. In one embodiment, the assistance information is provided upon request by the network. In one embodiment, the assistance information is provided in response to a change in assistance information. In one embodiment, the calculated measured result is an average of measured results for best N beams of the TRP. In one embodiment, the UE differentiates between different beams generated by a network based on beam identity and/or TRP identity. In one embodiment, the scheduling request is used by the UE to acquire radio resource(s) to transmit the assistance information. In one embodiment, at least a UE beam specific configuration is used to differentiate or indicate a UE beam. In one embodiment, the UE beam specific configuration comprises at least UE beam identity. In one embodiment, the UE beam specific configuration comprises at least time frequency resource for each UE beam.

In one embodiment, the two transmissions can be made via two different serving beams (assigned by the networks) for the UE. The serving beams are communicably coupled to their corresponding UE beams. In one embodiment, the first transmission and the second transmission occur via different TRPs of the same cell. In one embodiment, the first transmission and the second transmission occur on the same (time/frequency) radio resources. In one embodiment, the indication is transmitted by the network together with scheduling information. In another embodiment, the indication is transmitted separately from the scheduling information. In one embodiment, the first transmission and the second transmission include the same content if the two transmissions are indicated by the same signaling carrying the scheduling information.

In one example, the first transmission and the second transmission occur via different network beams controlled by a network node (e.g. a BS or TRP). In one example, transmissions occurring concurrently means the transmissions occur on the same radio resource, for example, the same time/frequency resource, via different serving beams for the UE. In another example, transmission occurring concurrently means the transmissions occur on the same radio resource, for example, the same time/frequency resource, via different network beams controlled by the same network node. In another example, transmission occurring concurrently means the transmissions occur on the same radio resource in the same time interval, for example, TTI, subframe, or symbol, via different serving beams for the UE. In another example, transmission occurring concurrently means the transmissions occur on the same radio resource in the same time interval, for example, TTI, subframe, or symbol, via different network beams controlled by the same network node.

In one example, an indication received from the network indicates whether the first transmission and the second transmission would contain the same or different content. In one implementation, transmissions with the same content can be combined for decoding. In one implementation, transmissions with the same content form the same data unit, e.g. MAC PDU. In one implementation, the UE decides whether it is receiving one or multiple data units from the network, via the first transmission and the second transmission, based on the indication. In one implementation, the UE decides whether to transmit one or multiple data unit to the network, via the first transmission and the second transmission, based on the indication.

In one embodiment, the network node determines the content of concurrent transmissions to the UE based on at least selected serving beam(s). In one embodiment, the network node determines the content of concurrent transmissions to the UE based on at least channel condition of the UE. In one embodiment, the network node determines the content of concurrent transmissions to the UE based on at least the amount of buffered data for transmission of the UE. In one embodiment, the indication is indicated by format of the scheduling information. In one embodiment, the indication indicates whether a transmission is associated with other transmission(s). In one embodiment, the indication indicates that the serving beam(s) are to be used for transmission(s) with the same content. Alternatively or additionally, the indication indicates that the UE beam(s) are to be used for transmission(s) with the same content. In one embodiment, the indication indicates whether the first transmission could be combined with the second transmission. In one embodiment, the first transmission and the second transmission include different content if they are indicated by different signaling carrying scheduling information.

In one embodiment, the network node is a central unit (CU). In one embodiment, the network node is a distributed unit (DU). In one embodiment, the network node is a transmission/reception point (TRP). In one embodiment, the network node is a base station (BS). In one embodiment, the network node is a 5G node. In one embodiment, the UE is in connected mode. In another embodiment, the network beams or serving beams for the UE are generated by different TRPs. Alternatively, the network beams or serving beams for the UE are generated by one TRP. In one embodiment, the transmission(s) are DL transmission(s) to the UE. In one embodiment, the transmission(s) are UL transmission(s) from the UE. In one embodiment, the first transmission and the second transmission occur within the same cell. In one embodiment, the first transmission and the second transmission occur via the same TRP. In one embodiment, the network beams/serving beams belong to a same cell. In one embodiment, the network beams/serving beams are generated by a same TRP. Alternatively, the network beams/serving beams are generated by different TRPs of the same cell.

Based on above methods and/or embodiment, the network can properly decide to schedule concurrent transmissions via different network beams with same or different content.

FIG. 14 illustrates beam mapping between a network and a UE. In the cell deployment 1400, the network 1410 is shown to have generated five candidate serving beams 1, 2, 3, 4 and 5. The UE 1420 is shown to have generated two UE beams a and b. The network 1410 and the UE 1420 perform beam mapping and select the proper serving beams and UE beams for communicating with each other. In one embodiment, one pair of beams, including a serving beam and a UE beam, is used to facilitate communication between the network/TRP 1410 and the UE 1420. In another embodiment, multiple pairs of serving and UE beams can be used to facilitate communication between the network/TRP 1410 and the UE 1420 concurrently. In yet another embodiment, one or both of the other TRPs 1430 and 1440, which also reside in the cell 1400, also communicate with the UE 1420 concurrently with the communication between the TRP 1410 and the UE 1420. Thus, in various embodiments, the UE 1420 can communicate with two or more TRPs 1410, 1430 and 1440 simultaneously and in parallel, by using multiple serving and UE beams. Also, as shown in FIG. 14, one UE beam b overlaps with and can be paired with two serving beams 3 and 4. UE beam b is wider than each of the serving beams 3 and 4.

Various embodiments of the subject disclosure described herein can be applied to or implemented in exemplary wireless communication systems and devices described below. In addition, various embodiments of the subject disclosure are described mainly in the context of the 3GPP architecture reference model. However, it is understood that with the disclosed information, one skilled in the art could easily adapt for use and implement aspects of the subject disclosure in a 3GPP2 network architecture as well as in other network architectures, as further described herein.

The exemplary wireless communication systems and devices described below employ a wireless communication system, supporting a broadcast service. Wireless communication systems are widely deployed to provide various types of communication such as voice, data, and so on. These systems may be based on code division multiple access (CDMA), time division multiple access (TDMA), orthogonal frequency division multiple access (OFDMA), 3GPP LTE (Long Term Evolution) wireless access, 3GPP LTE-A (Long Term Evolution Advanced) wireless access, 3GPP2 UMB (Ultra Mobile Broadband), WiMax, 3GPP NR (New Radio) wireless access for 5G, or some other modulation techniques.

FIG. 15 is a block diagram representing an exemplary non-limiting multiple access wireless communication system 1500 in which various embodiments described herein can be implemented. An access network 1502 (AN) includes multiple antenna groups, one group including antennas 1504 and 1506, another group including antennas 1508 and 1510, and an additional group including antennas 1512 and 1514. In FIG. 15, only two antennas are shown for each antenna group, however, more or fewer antennas may be utilized for each antenna group. Access terminal 1516 (AT) is in communication with antennas 1512 and 1514, where antennas 1512 and 1514 transmit information to access terminal 1516 over forward link 1518 and receive information from access terminal 1516 over reverse link 1520. Access terminal (AT) 1522 is in communication with antennas 1506 and 1508, where antennas 1506 and 1508 transmit information to access terminal (AT) 1522 over forward link 1524 and receive information from access terminal (AT) 1522 over reverse link 1526. In a Frequency Division Duplex (FDD) system, communication links 1518, 1520, 1524 and 1526 may use different frequency for communication. For example, forward link 1518 may use a different frequency than that used by reverse link 1520.

Each group of antennas and/or the area in which they are designed to communicate is often referred to as a sector of the access network. In non-limiting aspects, antenna groups each can be designed to communicate to access terminals in a sector of the areas covered by access network 1502.

In communication over forward links 1518 and 1524, the transmitting antennas of access network 1502 may utilize beamforming in order to improve the signal-to-noise ratio of forward links for the different access terminals 1516 and 1522. Also, an access network using beamforming to transmit to access terminals scattered randomly through its coverage normally causes less interference to access terminals in neighboring cells than an access network transmitting through a single antenna to all its access terminals.

An access network (AN) may be a fixed station or base station used for communicating with the terminals and may also be referred to as an access point, a Node B, a base station, an enhanced base station, an eNodeB, or some other terminology. An access terminal (AT) may also be called user equipment (UE), a communication device, a wireless communication device, a mobile device, a mobile communication device, a terminal, an access terminal or some other terminology.

FIG. 16 is a simplified block diagram of an exemplary non-limiting MIMO system 1600 depicting an exemplary embodiment of a transmitter system 1602 (also referred to herein as the access network) and a receiver system 1604 (also referred to herein as an access terminal (AT) or user equipment (UE)).

In a non-limiting aspect, each data stream can be transmitted over a respective transmit antenna. Exemplary TX data processor 1606 can format, code, and interleave the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide coded data.

The coded data for each data stream may be multiplexed with pilot data using OFDM techniques. The pilot data is typically a known data pattern that is processed in a known manner and may be used at the receiver system 1604 to estimate the channel response. The multiplexed pilot and coded data for each data stream is then modulated (e.g., symbol mapped) based on a particular modulation scheme (e.g., binary phase-shift keying (BPSK), quadrature phase shift keying (QPSK), M-ary or higher-order PSK (M-PSK), or M-ary quadrature amplitude modulation (M-QAM), etc.) selected for that data stream to provide modulation symbols. The data rate, coding, and modulation for each data stream may be determined by instructions performed by processor 1608.

The modulation symbols for all data streams are then provided to a TX MIMO processor 1610, which may further process the modulation symbols (e.g., for OFDM). TX MIMO processor 1610 then provides multiple (NT) modulation symbol streams to NT transmitters (TMTR) 1612 a through 1612 t. In certain embodiments, TX MIMO processor 1610 applies beamforming weights to the symbols of the data streams and to the antenna from which the symbol is being transmitted.

Each transmitter 1612 receives and processes a respective symbol stream to provide one or more analog signals, and further conditions (e.g., amplifies, filters, and upconverts, etc.) the analog signals to provide a modulated signal suitable for transmission over the MIMO channel. NT modulated signals from transmitters 1612 a through 1612 t are then transmitted from NT antennas 1614 a through 1614 t, respectively.

At receiver system 1604, the transmitted modulated signals are received by multiple (NR) antennas 1616 a through 1616 r and the received signal from each antenna 1616 is provided to a respective receiver (RCVR) 1618 a through 1618 r. Each receiver 1618 conditions (e.g., filters, amplifies, and downconverts, etc.) a respective received signal, digitizes the conditioned signal to provide samples, and further processes the samples to provide a corresponding “received” symbol stream.

A RX data processor 1620 then receives and processes the NR received symbol streams from NR receivers 1618 based on a particular receiver processing technique to provide NT “detected” symbol streams. The RX data processor 1620 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream. The processing by RX data processor 1620 is complementary to that performed by TX MIMO processor 1610 and TX data processor 1606 at transmitter system 1602.

A processor 1622 periodically determines which pre-coding matrix to use, for example, as further described herein. Processor 1622 formulates a reverse link message comprising a matrix index portion and a rank value portion.

The reverse link message may comprise various types of information regarding the communication link and/or the received data stream. The reverse link message is then processed by a TX data processor 1624, which also receives traffic data for a number of data streams from a data source 1626, modulated by a modulator 1628, conditioned by transmitters 1618 a through 1618 r, and transmitted back to transmitter system 1602.

At transmitter system 1602, the modulated signals from receiver system 1604 are received by antennas 1614, conditioned by receivers 1612, demodulated by a demodulator 1630, and processed by a RX data processor 1632 to extract the reserve link message transmitted by the receiver system 1604. Processor 1608 then determines which pre-coding matrix to use for determining the beamforming weights then processes the extracted message.

Memory 1634 may be used to temporarily store some buffered/computational data from 1630 or 1632 through Processor 1608, store some buffed data from data source 1636, or store some specific program codes, for example, as further described herein, for example, regarding FIGS. 10-13. Likewise, memory 1638 may be used to temporarily store some buffered/computational data from RX data processor 1620 through processor 1622, store some buffed data from data source 1626, or store some specific program codes, for example, as further described herein, for example, regarding FIGS. 10-13.

In view of the example embodiments described supra, devices and systems that can be implemented in accordance with the disclosed subject matter will be better appreciated with reference to the diagrams of FIGS. 10-13. While for purposes of simplicity of explanation, the example devices and systems are shown and described as a collection of blocks, it is to be understood and appreciated that the claimed subject matter is not limited by the order, arrangement, and/or number of the blocks, as some blocks may occur in different orders, arrangements, and/or combined and/or distributed with other blocks or functionality associated therewith from what is depicted and described herein. Moreover, not all illustrated blocks may be required to implement the example devices and systems described hereinafter. Additionally, it should be further understood that the example devices and systems and/or functionality disclosed hereinafter and throughout this specification are capable of being stored on an article of manufacture to facilitate transporting and transferring such methods to computers, for example, as further described herein. The terms computer readable medium, article of manufacture, and the like, as used herein, are intended to encompass a computer program product accessible from any computer-readable device or media such as a tangible computer readable storage medium.

It can be understood that various techniques described herein may be implemented in connection with hardware or software or, where appropriate, with a combination of both. As used herein, the terms “device,” “component.” “system” and the like are likewise intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a “device,” “component,” subcomponent. “system” portions thereof, and so on, may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on computer and the computer can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers.

It can be further understood that while a brief overview of example systems, methods, scenarios, and/or devices has been provided, the disclosed subject matter is not so limited. Thus, it can be further understood that various modifications, alterations, addition, and/or deletions can be made without departing from the scope of the embodiments as described herein. Accordingly, similar non-limiting implementations can be used or modifications and additions can be made to the described embodiments for performing the same or equivalent function of the corresponding embodiments without deviating therefrom.

FIG. 17 illustrates an example non-limiting device or system 1700 suitable for performing various aspects of the disclosed subject matter. The device or system 1700 can be a stand-alone device or a portion thereof, a specially programmed computing device or a portion thereof (e.g., a memory retaining instructions for performing the techniques as described herein coupled to a processor), and/or a composite device or system comprising one or more cooperating components distributed among several devices, as further described herein. As an example, example non-limiting device or system 1700 can comprise example any of the devices and/or systems illustrated in FIGS. 1-16, as described above, or as further described below regarding FIGS. 18-20, for example, or portions thereof. For example, FIG. 17 depicts an example device 1700, which can be the UE device 1516 or 1522. In another non-limiting example, FIG. 17 depicts an example device 1700, which can an access network 1420 or 1502, eNB 110 or a TRP 120, 124 or 128. The device 1700 can be configured to perform concurrent UL transmissions and concurrent DL transmissions as illustrated in FIGS. 10-13 and related description. The device or system 1700 can comprise a memory 1702 that retains computer-executable instructions on a tangible computer readable storage medium and those instructions can be executed by the processor 1704. By way of the example, the UE 1700 can receive indications from one or more TRPs and send assistance information to the TRPs. The UE 1700 can map its UE beams to serving beams, and facilitate concurrent transmissions of same or different content, based on the indication received from the network/TRP(s).

FIG. 18 depicts a simplified functional block diagram of an exemplary non-limiting communication device 1800, such as a UE device (e.g., UE device configured to perform beam management comprising AT 1516, AT 1522, receiver system 1604, or portions thereof, and/or as further described herein regarding FIGS. 12-18, etc.), a base station (e.g., a base station such as an access network 1502, a transmitter system 1502, and/or portions thereof, configured for beam handling, etc.), etc., suitable for incorporation of various aspects of the subject disclosure. As shown in FIG. 16, exemplary communication device 1600 in a wireless communication system can be utilized for realizing the UEs (or ATs) 1516 and 1522 in FIG. 15, for example, and the wireless communications system such as described above regarding FIG. 15, as a further example, can be the LTE system, the NR system, etc. Exemplary communication device 1800 can comprise an input device 1802, an output device 1804, a control circuit 1806, a central processing unit (CPU) 1808, a memory 1810, a program code 1812, and a transceiver 1814. Exemplary control circuit 1806 can execute the program code 1812 in the memory 1810 through the CPU 1808, thereby controlling an operation of the communications device 1800. Exemplary communications device 1800 can receive signals input by a user through the input device 1802, such as a keyboard or keypad, and can output images and sounds through the output device 1804, such as a monitor or speaker. Exemplary transceiver 1814 can be used to receive and transmit wireless signals, delivering received signals to the control circuit 1806, and outputting signals generated by the control circuit 1806 wirelessly, for example, as described above regarding FIG. 15.

Accordingly, further non-limiting embodiments as described herein can comprise a UE device (e.g., UE device configured for beam handling and comprising AT 1516, AT 1522, receiver system 1604, or portions thereof, and/or as further described herein regarding FIGS. 10-20, etc.) that can comprise one or more of a exemplary control circuit 1806, a processor (e.g., CPU 1808, etc.) installed in the control circuit (e.g., control circuit 1806), a memory (e.g., memory 1810) installed in the control circuit (e.g., control circuit 1806) and coupled to the processor (e.g., CPU 1808, etc.), wherein the processor (e.g., CPU 1808, etc.) is configured to execute a program code (e.g., program code 1812) stored in the memory (e.g., memory 1810) to perform method steps and/or provide functionality as described herein. As a non-limiting example, exemplary program code (e.g., program code 1812) can comprise computer-executable instructions as described above regarding FIG. 17, portions thereof, and/or complementary or supplementary instructions thereto, in addition to computer-executable instructions configured to achieve functionalities as described herein, regarding FIGS. 1-20, and/or any combinations thereof.

FIG. 19 depicts a simplified block diagram 1900 of exemplary program code 1812 shown in FIG. 18, suitable for incorporation of various aspects of the subject disclosure. In this embodiment, exemplary program code 1912 can comprise an application layer 1902, a Layer 3 portion 1904, and a Layer 2 portion 1906, and can be coupled to a Layer 1 portion 1908. The Layer 3 portion 1904 generally performs radio resource control. The Layer 2 portion 1906 generally performs link control. The Layer 1 portion 1908 generally performs physical connections. For LTE, LTE-A, or NR system, the Layer 2 portion 1906 may include a Radio Link Control (RLC) layer and a Medium Access Control (MAC) layer. The Layer 3 portion 1904 may include a Radio Resource Control (RRC) layer. In addition, as further described above, exemplary program code (e.g., program code 1912) can comprise computer-executable instructions as described above regarding FIG. 17, portions thereof, and/or complementary or supplementary instructions thereto, in addition to computer-executable instructions configured to achieve functionalities as described herein, regarding FIGS. 1-20, and/or any combinations thereof.

FIG. 20 depicts a schematic diagram of an example mobile device 2000 (e.g., a mobile handset. UE, AT, etc.) that can facilitate various non-limiting aspects of the disclosed subject matter in accordance with the embodiments described herein. Although mobile handset 2000 is illustrated herein, it will be understood that other devices can be any of a number of other a mobile devices, for instance, and that the mobile handset 2000 is merely illustrated to provide context for the embodiments of the subject matter described herein. The following discussion is intended to provide a brief, general description of an example of a suitable environment 2000 in which the various embodiments can be implemented. While the description includes a general context of computer-executable instructions embodied on a tangible computer readable storage medium, those skilled in the art will recognize that the subject matter also can be implemented in combination with other program modules and/or as a combination of hardware and software.

Generally, applications (e.g., program modules) can include routines, programs, components, data structures, etc., that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the methods described herein can be practiced with other system configurations, including single-processor or multiprocessor systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like, each of which can be operatively coupled to one or more associated devices.

A computing device can typically include a variety of computer readable media. Computer readable media can comprise any available media that can be accessed by the computer and includes both volatile and non-volatile media, removable and non-removable media. By way of example and not limitation, computer readable media can comprise tangible computer readable storage and/or communication media. Tangible computer readable storage can include volatile and/or non-volatile media, removable and/or non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. Tangible computer readable storage can include, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD ROM, digital video disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer.

Communication media, as contrasted with tangible computer readable storage, typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal, for example, as further described herein. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer readable communications media as distinguishable from computer-readable storage media.

The handset 2000 can include a processor 2002 for controlling and processing all onboard operations and functions. A memory 2004 interfaces to the processor 2002 for storage of data and one or more applications 2006 (e.g., communications applications such as browsers, apps, etc.). Other applications can support operation of communications and/or financial communications protocols. The applications 2006 can be stored in the memory 2004 and/or in a firmware 2008, and executed by the processor 2002 from either or both the memory 2004 or/and the firmware 2008. The firmware 2008 can also store startup code for execution in initializing the handset 2000. A communications component 2010 interfaces to the processor 2002 to facilitate wired/wireless communication with external systems, e.g., cellular networks, VoIP networks, and so on. Here, the communications component 2010 can also include a suitable cellular transceiver 2011 (e.g., a GSM transceiver, a CDMA transceiver, an LTE transceiver, etc.) and/or an unlicensed transceiver 2013 (e.g., Wireless Fidelity (WiFi™), Worldwide Interoperability for Microwave Access (WiMax®)) for corresponding signal communications, and the like. The handset 2000 can be a device such as a cellular telephone, a personal digital assistant (PDA) with mobile communications capabilities, and messaging-centric devices. The communications component 2010 also facilitates communications reception from terrestrial radio networks (e.g., broadcast), digital satellite radio networks, and Internet-based radio services networks, and so on.

The handset 2000 includes a display 2012 for displaying text, images, video, telephony functions (e.g., a Caller ID function, etc.), setup functions, and for user input. For example, the display 2012 can also be referred to as a “screen” that can accommodate the presentation of multimedia content (e.g., music metadata, messages, wallpaper, graphics, etc.). The display 2012 can also display videos and can facilitate the generation, editing and sharing of video quotes. A serial I/O interface 2014 is provided in communication with the processor 2002 to facilitate wired and/or wireless serial communications (e.g. Universal Serial Bus (USB), and/or Institute of Electrical and Electronics Engineers (IEEE) 1494) through a hardwire connection, and other serial input devices (e.g., a keyboard, keypad, and mouse). This supports updating and troubleshooting the handset 2000, for example. Audio capabilities are provided with an audio I/O component 2016, which can include a speaker for the output of audio signals related to, for example, indication that the user pressed the proper key or key combination to initiate the user feedback signal. The audio I/O component 2016 also facilitates the input of audio signals through a microphone to record data and/or telephony voice data, and for inputting voice signals for telephone conversations.

The handset 2000 can include a slot interface 2018 for accommodating a SIC (Subscriber Identity Component) in the form factor of a card Subscriber Identity Module (SIM) or universal SIM 2020, and interfacing the SIM card 2020 with the processor 2002. However, it is to be appreciated that the SIM card 2020 can be manufactured into the handset 2000, and updated by downloading data and software.

The handset 2000 can process Internet Protocol (IP) data traffic through the communication component 2010 to accommodate IP traffic from an IP network such as, for example, the Internet, a corporate intranet, a home network, a person area network, a cellular network, etc., through an internet service provider (ISP) or broadband cable provider. Thus, VoIP traffic can be utilized by the handset 2000 and IP-based multimedia content can be received in either an encoded or a decoded format.

A video processing component 2022 (e.g., a camera and/or associated hardware, software, etc.) can be provided for decoding encoded multimedia content. The video processing component 2022 can aid in facilitating the generation and/or sharing of video. The handset 2000 also includes a power source 2024 in the form of batteries and/or an alternating current (AC) power subsystem, which power source 2024 can interface to an external power system or charging equipment (not shown) by a power input/output (I/O) component 2026.

The handset 1800 can also include a video component 2030 for processing video content received and, for recording and transmitting video content. For example, the video component 2030 can facilitate the generation, editing and sharing of video. A location-tracking component 2032 facilitates geographically locating the handset 2000. A user input component 2034 facilitates the user inputting data and/or making selections as previously described. The user input component 2034 can also facilitate selecting perspective recipients for fund transfer, entering amounts requested to be transferred, indicating account restrictions and/or limitations, as well as composing messages and other user input tasks as required by the context. The user input component 2034 can include such conventional input device technologies such as a keypad, keyboard, mouse, stylus pen, and/or touch screen, for example.

Referring again to the applications 2006, a hysteresis component 1836 facilitates the analysis and processing of hysteresis data, which is utilized to determine when to associate with an access point. A software trigger component 2038 can be provided that facilitates triggering of the hysteresis component 2038 when a WiFi™ transceiver 1813 detects the beacon of the access point. A Session Initiation Protocol (SIP) client 2040 enables the handset 2000 to support SIP protocols and register the subscriber with the SIP registrar server. The applications 1806 can also include a communications application or client 2046 that, among other possibilities, can facilitate user interface component functionality as described above.

Various aspects of the disclosure have been described above. It should be apparent that the teachings herein may be embodied in a wide variety of forms and that any specific structure, function, or both being disclosed herein is merely representative. Based on the teachings herein one skilled in the art should appreciate that an aspect disclosed herein may be implemented independently of any other aspects and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, such an apparatus may be implemented or such a method may be practiced using other structure, functionality, or structure and functionality in addition to or other than one or more of the aspects set forth herein. As an example of some of the above concepts, in some aspects concurrent channels may be established based on pulse repetition frequencies. In some aspects concurrent channels may be established based on pulse position or offsets. In some aspects concurrent channels may be established based on time hopping sequences. In some aspects concurrent channels may be established based on pulse repetition frequencies, pulse positions or offsets, and time hopping sequences.

Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

Those of skill would further appreciate that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two, which may be designed using source coding or some other technique), various forms of program or design code incorporating instructions (which may be referred to herein, for convenience, as “software” or a “software module”), or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

In addition, the various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented within or performed by an integrated circuit (“IC”), an access terminal, or an access point. The IC may comprise a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, electrical components, optical components, mechanical components, or any combination thereof designed to perform the functions described herein, and may execute codes or instructions that reside within the IC, outside of the IC, or both. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

It is understood that any specific order or hierarchy of steps in any disclosed process is an example of a sample approach. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged while remaining within the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.

The steps of a method or algorithm described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module (e.g., including executable instructions and related data) and other data may reside in a data memory such as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of computer-readable storage medium known in the art. A sample storage medium may be coupled to a machine such as, for example, a computer/processor (which may be referred to herein, for convenience, as a “processor”) such that the processor can read information (e.g., code or program code) from and write information to the storage medium. A sample storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in user equipment. In the alternative, the processor and the storage medium may reside as discrete components in user equipment. Moreover, in some aspects any suitable computer-program product may comprise a computer-readable medium comprising codes relating to one or more of the aspects of the disclosure. In some aspects a computer program product may comprise packaging materials.

While the various embodiments of the subject disclosure have been described in connection with various non-limiting aspects, it will be understood that the embodiments of the subject disclosure may be capable of further modifications. This application is intended to cover any variations, uses or adaptation of the subject disclosure following, in general, the principles of the subject disclosure, and including such departures from the present disclosure as come within the known and customary practice within the art to which the subject disclosure pertains.

Those skilled in the art will recognize that it is common within the art to describe devices and/or processes in the fashion set forth herein, and thereafter use engineering practices to integrate such described devices and/or processes into systems. That is, at least a portion of the devices and/or processes described herein can be integrated into a system via a reasonable amount of experimentation. Those having skill in the art will recognize that a typical system can include one or more of a system unit housing, a video display device, a memory such as volatile and non-volatile memory, processors such as microprocessors and digital signal processors, computational entities such as operating systems, drivers, graphical user interfaces, and applications programs, one or more interaction devices, such as a touch pad or screen, and/or control systems including feedback loops and control device (e.g., feedback for sensing position and/or velocity; control devices for moving and/or adjusting parameters). A typical system can be implemented utilizing any suitable commercially available components, such as those typically found in data computing/communication and/or network computing/communication systems.

Various embodiments of the disclosed subject matter sometimes illustrate different components contained within, or connected with, other components. It is to be understood that such depicted architectures are merely exemplary, and that, in fact, many other architectures can be implemented which achieve the same and/or equivalent functionality. In a conceptual sense, any arrangement of components to achieve the same and/or equivalent functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermediary components. Likewise, any two components so associated can also be viewed as being “operably connected,” “operably coupled,” “communicatively connected,” and/or “communicatively coupled,” to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being “operably couplable” or “communicatively couplable” to each other to achieve the desired functionality. Specific examples of operably couplable or communicatively couplable can include, but are not limited to, physically mateable and/or physically interacting components, wirelessly interactable and/or wirelessly interacting components, and/or logically interacting and/or logically interactable components.

With respect to substantially any plural and/or singular terms used herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as can be appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for the sake of clarity, without limitation.

It will be understood by those skilled in the art that, in general, terms used herein, and especially in the appended claims (e.g., bodies of the appended claims) are generally intended as “open” terms (e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes, but is not limited to,” etc.). It will be further understood by those skilled in the art that, if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases “at least one” and “one or more” to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles “a” or “an” limit any particular claim containing such introduced claim recitation to embodiments containing only one such recitation, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an” (e.g., “a” and/or “an” should be interpreted to mean “at least one” or “one or more”); the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number (e.g., the bare recitation of “two recitations,” without other modifiers, means at least two recitations, or two or more recitations). Furthermore, in those instances where a convention analogous to “at least one of A. B, and C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, and C” would include, but not be limited to, systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). In those instances where a convention analogous to “at least one of A, B, or C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B. and C together, etc.). It will be further understood by those skilled in the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B.”

In addition, where features or aspects of the disclosure are described in terms of Markush groups, those skilled in the art will recognize that the disclosure is also thereby described in terms of any individual member or subgroup of members of the Markush group.

As will be understood by one skilled in the art, for any and all purposes, such as in terms of providing a written description, all ranges disclosed herein also encompass any and all possible sub-ranges and combinations of sub-ranges thereof. Any listed range can be easily recognized as sufficiently describing and enabling the same range being broken down into at least equal halves, thirds, quarters, fifths, tenths, etc. As a non-limiting example, each range discussed herein can be readily broken down into a lower third, middle third and upper third, etc. As will also be understood by one skilled in the art all language such as “up to”, “at least”, and the like include the number recited and refer to ranges which can be subsequently broken down into sub-ranges as discussed above. Finally, as will be understood by one skilled in the art, a range includes each individual member. Thus, for example, a group having 1-3 cells refers to groups having 1, 2, or 3 cells. Similarly, a group having 1-5 cells refers to groups having 1, 2, 3, 4, or 5 cells, and so forth.

From the foregoing, it will be noted that various embodiments of the disclosed subject matter have been described herein for purposes of illustration, and that various modifications may be made without departing from the scope and spirit of the subject disclosure. Accordingly, the various embodiments disclosed herein are not intended to be limiting, with the true scope and spirit being indicated by the appended claims.

In addition, the words “example” and “non-limiting” are used herein to mean serving as an example, instance, or illustration. For the avoidance of doubt, the subject matter disclosed herein is not limited by such examples. Moreover, any aspect or design described herein as “an example,” “an illustration.” “example” and/or “non-limiting” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent example structures and techniques known to those of ordinary skill in the art. Furthermore, to the extent that the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, for the avoidance of doubt, such terms are intended to be inclusive in a manner similar to the term “comprising” as an open transition word without precluding any additional or other elements, as described above.

As mentioned, the various techniques described herein can be implemented in connection with hardware or software or, where appropriate, with a combination of both. As used herein, the terms “component,” “system” and the like are likewise intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on computer and the computer can be a component. In addition, one or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers.

Systems described herein can be described with respect to interaction between several components. It can be understood that such systems and components can include those components or specified sub-components, some of the specified components or sub-components, or portions thereof, and/or additional components, and various permutations and combinations of the foregoing. Sub-components can also be implemented as components communicatively coupled to other components rather than included within parent components (hierarchical). Additionally, it should be noted that one or more components can be combined into a single component providing aggregate functionality or divided into several separate sub-components, and that any one or more middle component layers, such as a management layer, can be provided to communicatively couple to such sub-components in order to provide integrated functionality, as mentioned. Any components described herein can also interact with one or more other components not specifically described herein but generally known by those of skill in the art.

As mentioned, in view of the example systems described herein, methods that can be implemented in accordance with the described subject matter can be better appreciated with reference to the flowcharts of the various figures and vice versa. While for purposes of simplicity of explanation, the methods can be shown and described as a series of blocks, it is to be understood and appreciated that the claimed subject matter is not limited by the order of the blocks, as some blocks can occur in different orders and/or concurrently with other blocks from what is depicted and described herein. Where non-sequential, or branched, flow is illustrated via flowchart, it can be understood that various other branches, flow paths, and orders of the blocks, can be implemented which achieve the same or a similar result. Moreover, not all illustrated blocks can be required to implement the methods described hereinafter.

While the disclosed subject matter has been described in connection with the disclosed embodiments and the various figures, it is to be understood that other similar embodiments may be used or modifications and additions may be made to the described embodiments for performing the same function of the disclosed subject matter without deviating therefrom. Still further, multiple processing chips or multiple devices can share the performance of one or more functions described herein, and similarly, storage can be effected across a plurality of devices. In other instances, variations of process parameters (e.g., configuration, number of components, aggregation of components, process step timing and order, addition and/or deletion of process steps, addition of preprocessing and/or post-processing steps, etc.) can be made to further optimize the provided structures, devices and methods, as shown and described herein. In any event, the systems, structures and/or devices, as well as the associated methods described herein have many applications in various aspects of the disclosed subject matter, and so on. Accordingly, the subject disclosure should not be limited to any single embodiment, but rather should be construed in breadth, spirit and scope in accordance with the appended claims. 

What is claimed is:
 1. A method for a User Equipment (UE), comprising: receiving an indication about whether two concurrent transmissions to the UE can be combined for decoding; receiving a first transmission via a first UE beam; and receiving a second transmission via a second UE beam, wherein the first transmission and the second transmission occur concurrently.
 2. The method of claim 1, further comprising: determining whether to combine the first transmission and the second transmission for decoding based on the indication.
 3. The method of claim 1, wherein the first transmission is via a first network beam and the second transmission is via a second network beam.
 4. The method of claim 3, wherein the first network beam and the second network beam are generated by different Transmission/Reception Points (TRPs).
 5. The method of claim 1, wherein the indication indicates network beams are to be used for the two concurrent transmissions with the same Medium Access Control (MAC) Protocol Data Unit (PDU).
 6. The method of claim 1, wherein the indication is transferred together with scheduling information or is transferred separately from the scheduling information.
 7. The method of claim 1, wherein at least one of: the first transmission and the second transmission include the same Medium Access Control (MAC) Protocol Data Unit (PDU) if the first transmission and the second transmission are indicated by the same signaling carrying scheduling information; or the first transmission and the second transmission include different MAC PDUs if the first transmission and the second transmission are indicated by different signaling carrying scheduling information.
 8. The method of claim 1, further comprising: determining whether to combine the first transmission and the second transmission for decoding based on whether the first transmission and the second transmission include the same Medium Access Control (MAC) Protocol Data Unit (PDU).
 9. A method for a network node, comprising: transmitting an indication to a User Equipment (UE) about whether two concurrent transmissions to the UE can be combined for decoding; transmitting a first transmission to the UE via a first UE beam; and transmitting a second transmission to the UE via a second UE beam, wherein the first transmission and the second transmission occur concurrently.
 10. The method of claim 9, wherein the first transmission is via a first network beam and the second transmission is via a second network beam.
 11. The method of claim 10, wherein the first network beam and the second network beam are generated by different Transmission/Reception Points (TRPs).
 12. The method of claim 9, wherein the indication indicates network beams are to be used for the two concurrent transmissions with the same Medium Access Control (MAC) Protocol Data Unit (PDU).
 13. The method of claim 9, wherein the indication is transferred together with scheduling information or is transferred separately from the scheduling information.
 14. The method of claim 9, wherein at least one of: the first transmission and the second transmission include the same MAC PDU if the first transmission and the second transmission are indicated by the same signaling carrying scheduling information; or the first transmission and the second transmission include different Medium Access Control (MAC) Protocol Data Units (PDUs) if the first transmission and the second transmission are indicated by different signaling carrying scheduling information.
 15. A user equipment (UE), comprising: a control circuit; a processor installed in the control circuit; and a memory installed in the control circuit and operatively coupled to the processor, wherein the processor is configured to execute a program code stored in the memory to perform operations comprising: receiving an indication about whether two concurrent transmissions to the UE can be combined for decoding; receiving a first transmission via a first UE beam; and receiving a second transmission via a second UE beam, wherein the first transmission and the second transmission occur concurrently.
 16. The UE of claim 15, the operations further comprising: determining whether to combine the first transmission and the second transmission for decoding based on the indication.
 17. The UE of claim 15, wherein the indication indicates network beams are to be used for the two concurrent transmissions with the same Medium Access Control (MAC) Protocol Data Unit (PDU).
 18. The UE of claim 15, wherein the indication is transferred together with scheduling information or is transferred separately from the scheduling information.
 19. The UE of claim 15, wherein at least one of: the first transmission and the second transmission include the same Medium Access Control (MAC) Protocol Data Unit (PDU) if the first transmission and the second transmission are indicated by the same signaling carrying scheduling information; or the first transmission and the second transmission include different MAC PDUs if the first transmission and the second transmission are indicated by different signaling carrying scheduling information.
 20. The UE of claim 15, the operations further comprising: determining whether to combine the first transmission and the second transmission for decoding based on whether the first transmission and the second transmission include the same Medium Access Control (MAC) Protocol Data Unit (PDU). 